Lack of Gromov-Hyperbolicity in Colored Random Networks
نویسندگان
چکیده
The geometry of complex networks has a close relationship with their structure and function. In this paper, we introduce an inhomogeneous random network G(n, {ci}, {pi}), called the colored random network, and investigate its Gromov-hyperbolicity. We show that the colored random networks are non-hyperbolic in the regime Pm i=1 c 2 i pi = c/n for c > 1, by approximation to binomial random graphs. Numerical simulations are provided to illustrate our results. AMS (MOS) Subject Classification: 05C80 (05C12)
منابع مشابه
Lack of Hyperbolicity in Asymptotic Erdös-Renyi Sparse Random Graphs
In this work, we prove that the giant component of the Erdös–Renyi random graph G(n, c/n) for c a constant greater than 1 (sparse regime), is not Gromov δ–hyperbolic for any δ with probability tending to one as n → ∞. We present numerical evidence to show that the “fat” triangles that rule out δ–hyperbolicity are in fact abundant in these graphs. We also present numerical evidence showing that,...
متن کاملOn Computing the Hyperbolicity of Real-World Graphs
The (Gromov) hyperbolicity is a topological property of a graph, which has been recently applied in several different contexts, such as the design of routing schemes, network security, computational biology, the analysis of graph algorithms, and the classification of complex networks. Computing the hyperbolicity of a graph can be very time consuming: indeed, the best available algorithm has run...
متن کاملOn the Hyperbolicity of Random Graphs
Let G = (V,E) be a connected graph with the usual (graph) distance metric d : V ×V → N∪{0}. Introduced by Gromov, G is δ-hyperbolic if for every four vertices u, v, x, y ∈ V , the two largest values of the three sums d(u, v) + d(x, y), d(u, x) + d(v, y), d(u, y) + d(v, x) differ by at most 2δ. In this paper, we determine precisely the value of this hyperbolicity for most binomial random graphs.
متن کاملComputing the Gromov hyperbolicity of a discrete metric space
We give exact and approximation algorithms for computing the Gromov hyperbolicity of an n-point discrete metric space. We observe that computing the Gromov hyperbolicity from a fixed base-point reduces to a (max,min) matrix product. Hence, using the (max,min) matrix product algorithm by Duan and Pettie, the fixed base-point hyperbolicity can be determined in O(n) time. It follows that the Gromo...
متن کاملStrong Hyperbolicity
We propose the metric notion of strong hyperbolicity as a way of obtaining hyperbolicity with sharp additional properties. Specifically, strongly hyperbolic spaces are Gromov hyperbolic spaces that are metrically well-behaved at infinity, and, under weak geodesic assumptions, they are strongly bolic as well. We show that CAT(−1) spaces are strongly hyperbolic. On the way, we determine the best ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011